Numeric Domains with Summarized Dimensions
نویسندگان
چکیده
We introduce a systematic approach to designing summarizing abstract numeric domains from existing numeric domains. Summarizing domains use summary dimensions to represent potentially unbounded collections of numeric objects. Such domains are of benefit to analyses that verify properties of systems with an unbounded number of numeric objects, such as shape analysis, or systems in which the number of numeric objects is bounded, but large.
منابع مشابه
Summarized Dimensions Revisited
The task of summarizing memory regions becomes increasingly important in the analysis of data structures and the analysis of recursive functions. Calculating summaries of memory regions containing several abstract variables becomes quite subtle when using relational abstract domains. We address this challenge using two principal operations, fold and expand , that calculate such summaries for an...
متن کاملConsistency Techniques for Numeric CSPs
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the consistency techniques that have been developed for CSPs can be adapted to numeric CSPs. Since the numeric domains are ordered the underlying idea is to handle domains only by their bounds. The semantics that have bee...
متن کاملA Hybrid Relaxed Planning Graph'LP Heuristic for Numeric Planning Domains
Effective search control for numeric planning domains, in which appropriate numeric resource usage is critical to solving the problem, remains an open challenge in domainindependent planning. Most real-world problems rely on metric resources such as energy, money, fuel or materials. Despite the importance of numbers, few heuristics have been proposed to guide search in such domains. Hoffmann’s ...
متن کاملMulti-objective Numeric Association Rules Mining via Ant Colony Optimization for Continuous Domains without Specifying Minimum Support and Minimum Confidence
Currently, all search algorithms which use discretization of numeric attributes for numeric association rule mining, work in the way that the original distribution of the numeric attributes will be lost. This issue leads to loss of information, so that the association rules which are generated through this process are not precise and accurate. Based on this fact, algorithms which can natively h...
متن کاملPlanning with Linear Continuous Numeric Change
Reasoning with domains containing continuous numeric change remains an open challenge in planning. In this paper, we discuss how an established temporal planner, CRIKEY3, can be adapted to plan in domains containing linear continuous numeric change. In particular, we discuss how an LP can be used to scheudule action choices, and how the LPRPG heuristic (hitherto for non-temporal planning) can b...
متن کامل